package design;

import java.util.Arrays;
import java.util.Set;
import java.util.TreeSet;

public class Oo {
    public static void main(String[] args) {

        //ab,er,women,yang,li,qiu
//        System.out.println( "ab".hashCode());
//        System.out.println( "er".hashCode());
//        System.out.println( "women".hashCode());
//        System.out.println( "yang".hashCode());
//        System.out.println( "li".hashCode());
//        System.out.println( "qiu".hashCode());

        System.out.println(123+45+122.06+""+1+2+4+9);

        String[] str1 = {"22","44","11","22"};
        String[] str2 = {"33","4","6","199","11"};

        //数组合并
        int oldLength = str1.length;
        str1 = Arrays.copyOf(str1, str1.length + str2.length);
        System.arraycopy(str2, 0, str1, oldLength,str2.length);

        // 去重,排序
        Set<Integer> set = new TreeSet();
        for (String str : str1) {
            set.add(Integer.valueOf(str));
        }
        System.out.println(set.toString());
    }
}
